Decomposable non-negative matrices in a dynamic programming problem

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving a Two-Period Cooperative Advertising Problem Using Dynamic Programming

Cooperative advertising is a cost-sharing mechanism in which a part of retailers' advertising investments are financed by the manufacturers. In recent years, investment among advertising options has become a difficult marketing issue. In this paper, the cooperative advertising problem with advertising options is investigated in a two-period horizon in which the market share in the second period...

متن کامل

A Hybrid Dynamic Programming for Inventory Routing Problem in Collaborative Reverse Supply Chains

Inventory routing problems arise as simultaneous decisions in inventory and routing optimization. In the present study, vendor managed inventory is proposed as a collaborative model for reverse supply chains and the optimization problem is modeled in terms of an inventory routing problem. The studied reverse supply chains include several return generators and recovery centers and one collection...

متن کامل

On Non-negative-valued Matrices.

cording to our Theorem, if (4) is fulfilled, f3 and a can be so chosen that (2) be fulfilled. This form shows, however, that the lowest term in the determinant Ioua'+ Owa-11, if considered as a polynomial in E, is {nT Hence, the lowest term in the determinant :u ± EWI is I0K-1Iaean-r, i.e., the coefficient of (n7r in the determinant |u + Ew| does not vanish. Conversely, let us assume that u and...

متن کامل

Averaging of Decomposable Graphs by Dynamic Programming and Sampling

We present algorithms for Bayesian learning of decomposable models from data. Priors of a certain form admit exact averaging in O(3nn3) time and sampling T graphs from the posterior in O(4n + nT) time. To target a broader class of priors we associate each sample with an importance weight. Empirically, we compare averaging to optimization and demonstrate the accuracy of our importance sampling e...

متن کامل

Non-monotone systems decomposable into monotone systems with negative feedback

Motivated by the work of Angeli and Sontag [1] and Enciso and Sontag [7] in control theory, we show that certain finite and infinite dimensional semi-dynamical systems with “negative feedback” can be decomposed into a monotone “open loop” system with “inputs” and a decreasing “output” function. The original system is reconstituted by “plugging the output into the input”. Employing a technique o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Czechoslovak Mathematical Journal

سال: 1970

ISSN: 0011-4642,1572-9141

DOI: 10.21136/cmj.1970.100978